Fragments of ML Decidable by Nested Data Class Memory Automata

The call-by-value language RML may be viewed as a canonical restriction of Standard ML to ground-type references, augmented by a "bad variable" construct in the sense of Reynolds. We consider the fragment of (finitary) RML terms of order at most 1 with free variables of order at most 2, and identify two subfragments of this for which we show observational equivalence to be decidable. The first subfragment consists of those terms in which the P-pointers in the game semantic representation are determined by the underlying sequence of moves. The second subfragment consists of terms in which the O-pointers of moves corresponding to free variables in the game semantic representation are determined by the underlying moves. These results are shown using a reduction to a form of automata over data words in which the data values have a tree-structure, reflecting the tree-structure of the threads in the game semantic plays. In addition we show that observational equivalence is undecidable at every third- or higher-order type, every second-order type which takes at least two first-order arguments, and every second-order type (of arity greater than one) that has a first-order argument which is not the final argument

Tree Buffers

In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program’s execution as it happens. If the program being observed has hard real-time constraints, then the monitor inherits them. In the presence of hard real-time constraints it becomes a challenge to maintain enough information to produce error traces, should a property violation be observed. In this paper we introduce a data structure, called tree buffer, that solves this problem in the context of automata-based monitors: If the monitor itself respects hard real-time constraints, then enriching it by tree buffers makes it possible to provide error traces, which are essential for diagnosing defects. We show that tree buffers are also useful in other application domains. For example, they can be used to implement functionality of capturing groups in regular expressions. We prove optimal asymptotic bounds for our data structure, and validate them using empirical data from two sources: regular expression searching through Wikipedia, and runtime verification of execution traces obtained from the DaCapo test suite

New Deterministic Algorithms for Solving Parity Games

We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time $k^{O(\sqrt{k})}\cdot O(n^3)$, and general parity games in time $(p+k)^{O(\sqrt{k})} \cdot O(pnm)$, where $p$ is the number of distinct priorities and $m$ is the number of edges. For all games with $k = o(n)$ this improves the previously fastest algorithm by Jurdzi{\'n}ski, Paterson, and Zwick (SICOMP 2008). We also obtain novel kernelization results and an improved deterministic algorithm for graphs with small average degree

Space Saving by Dynamic Algebraization

Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study the problem of designing efficient dynamic programming algorithm based on tree decompositions in polynomial space. We show how to construct a tree decomposition and extend the algebraic techniques of Lokshtanov and Nederlof such that the dynamic programming algorithm runs in time $O^*(2^h)$, where $h$ is the maximum number of vertices in the union of bags on the root to leaf paths on a given tree decomposition, which is a parameter closely related to the tree-depth of a graph. We apply our algorithm to the problem of counting perfect matchings on grids and show that it outperforms other polynomial-space solutions. We also apply the algorithm to other set covering and partitioning problems.Comment: 14 pages, 1 figur

Separation of Oligosaccharides from Lotus Seeds via Medium-pressure Liquid Chromatography Coupled with ELSD and DAD

peer-reviewedLotus seeds were identified by the Ministry of Public Health of China as both food and medicine. One general function of lotus seeds is to improve intestinal health. However, to date, studies evaluating the relationship between bioactive compounds in lotus seeds and the physiological activity of the intestine are limited. In the present study, by using medium pressure liquid chromatography coupled with evaporative light-scattering detector and diode-array detector, five oligosaccharides were isolated and their structures were further characterized by electrospray ionization-mass spectrometry and gas chromatography-mass spectrometry. In vitro testing determined that LOS3-1 and LOS4 elicited relatively good proliferative effects on Lactobacillus delbrueckii subsp. bulgaricus. These results indicated a structure-function relationship between the physiological activity of oligosaccharides in lotus seeds and the number of probiotics applied, thus providing room for improvement of this particular feature. Intestinal probiotics may potentially become a new effective drug target for the regulation of immunity

The Social Climbing Game

The structure of a society depends, to some extent, on the incentives of the individuals they are composed of. We study a stylized model of this interplay, that suggests that the more individuals aim at climbing the social hierarchy, the more society's hierarchy gets strong. Such a dependence is sharp, in the sense that a persistent hierarchical order emerges abruptly when the preference for social status gets larger than a threshold. This phase transition has its origin in the fact that the presence of a well defined hierarchy allows agents to climb it, thus reinforcing it, whereas in a "disordered" society it is harder for agents to find out whom they should connect to in order to become more central. Interestingly, a social order emerges when agents strive harder to climb society and it results in a state of reduced social mobility, as a consequence of ergodicity breaking, where climbing is more difficult.Comment: 14 pages, 9 figure

NQO2 is a reactive oxygen species generating off-target for acetaminophen

[Image: see text] The analgesic and antipyretic compound acetaminophen (paracetamol) is one of the most used drugs worldwide. Acetaminophen overdose is also the most common cause for acute liver toxicity. Here we show that acetaminophen and many structurally related compounds bind quinone reductase 2 (NQO2) in vitro and in live cells, establishing NQO2 as a novel off-target. NQO2 modulates the levels of acetaminophen derived reactive oxygen species, more specifically superoxide anions, in cultured cells. In humans, NQO2 is highly expressed in liver and kidney, the main sites of acetaminophen toxicity. We suggest that NQO2 mediated superoxide production may function as a novel mechanism augmenting acetaminophen toxicity

The effect of mixing entire male pigs prior to transport to slaughter on behaviour, welfare and carcass lesions

peer-reviewedData set for article is also provided.Research is needed to validate lesions recorded at meat inspection as indicators of pig welfare on farm. The aims were to determine the influence of mixing pigs on carcass lesions and to establish whether such lesions correlate with pig behaviour and lesions scored on farm. Aggressive and mounting behaviour of pigs in three single sex pens was recorded on Day −5, −2, and −1 relative to slaughter (Day 0). On Day 0 pigs were randomly allocated to 3 treatments (n = 20/group) over 5 replicates: males mixed with females (MF), males mixed with males (MM), and males unmixed (MUM). Aggressive and mounting behaviours were recorded on Day 0 at holding on farm and lairage. Skin/tail lesions were scored according to severity at the farm (Day −1), lairage, and on the carcass (Day 0). Effect of treatment and time on behaviour and lesions were analysed by mixed models. Spearman rank correlations between behaviour and lesion scores and between scores recorded at different stages were determined. In general, MM performed more aggressive behaviour (50.4 ± 10.72) than MUM (20.3 ± 9.55, P < 0.05) and more mounting (30.9 ± 9.99) than MF (11.4 ± 3.76) and MUM (9.8 ± 3.74, P < 0.05). Skin lesion scores increased between farm (Day −1) and lairage (P < 0.001), but this tended to be significant only for MF and MM (P = 0.08). There was no effect of treatment on carcass lesions and no associations were found with fighting/mounting. Mixing entire males prior to slaughter stimulated mounting and aggressive behaviour but did not influence carcass lesion scores. Carcass skin/tail lesions scores were correlated with scores recorded on farm (rskin = 0.21 and rtail = 0.18, P < 0.01) suggesting that information recorded at meat inspection could be used as indicators of pig welfare on farm.This study was part of the PIGWELFIND project funded by the Department of Agriculture, Food and the Marine (DAFM), Ireland